In this paper, we present Slack Stealing Job Admission Control (SSJAC)|a methodology for scheduling periodic rm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments the slack stealing algorithm of Thuel et al with an admission control policy to manage the variability in t...

Admission control (call control) is a well-studied online problem. We are given a xed graph with edge capacities, and must process a sequence of calls that arrive over time, accepting some and rejecting others in order to stay within capacity limitations of the network. In the standard theoretical formulation, this problem is analyzed as a beneet problem: the goal is to devise an online algorit...

Provisioning multiple service classes with different performance characteristics (e.g., throughput and delay) is an important challenge for future packet networks. However, in large-scale networks, individually managing each traffic flow on each of its traversed routers has fundamental scalability limitations, in both the control plane’s requirements for signaling, state management, and admissi...

Network admission control (NAC) limits the traffic in a network to avoid overload and to assure thereby the quality of service (QoS) for admitted flows. Overload may occur due to exceptional traffic demand, but it is mostly caused by redirected traffic due to link failures. Conventional NAC methods cannot cope with network outages and fail when they are needed most. This paper categorizes exist...

We present algorithms and hardness results for three resource allocation problems. The first is an abstract admission control problem where the system receives a series of requests and wants to satisfy as many as possible, but has bounded resources. This occurs, for example, when allocating network bandwidth to incoming calls so the calls receive guaranteed quality of service. Algorithms can ha...